On two problems in graph Ramsey theory
نویسندگان
چکیده
منابع مشابه
On two problems in graph Ramsey theory
We study two classical problems in graph Ramsey theory, that of determining the Ramsey number of bounded-degree graphs and that of estimating the induced Ramsey number for a graph with a given number of vertices. The Ramsey number r(H) of a graph H is the least positive integer N such that every twocoloring of the edges of the complete graph KN contains a monochromatic copy of H. A famous resul...
متن کاملInduced Graph Ramsey Theory
We say that a graph F strongly arrows (G, H) and write F (G, H) if for every edge-coloring of F with colors red and blue a red G or a blue H occurs as an induced subgraph of F . Induced Ramsey numbers are defined by r(G, H) = min{|V (G)| : F (G, H)}. The value of r(G, H) is finite for all graphs, and good upper bounds on induced Ramsey numbers in general, and for particular families of grap...
متن کاملGraph Parameters and Ramsey Theory
Ramsey’s Theorem tells us that there are exactly two minimal hereditary classes containing graphs with arbitrarily many vertices: the class of complete graphs and the class of edgeless graphs. In other words, Ramsey’s Theorem characterizes the graph vertex number in terms of minimal hereditary classes where this parameter is unbounded. In the present paper, we show that a similar Ramsey-type ch...
متن کاملTwo Extremal Problems in Graph Theory
We consider the following two problems. (1) Let t and n be positive integers with n ≥ t ≥ 2. Determine the maximum number of edges of a graph of order n that contains neither Kt nor Kt,t as a subgraph. (2) Let r, t and n be positive integers with n ≥ rt and t ≥ 2. Determine the maximum number of edges of a graph of order n that does not contain r disjoint copies of Kt. Problem 1 for n < 2t is s...
متن کاملRecent developments in graph Ramsey theory
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring of the edges of KN contains a monochromatic copy of H. The existence of these numbers has been known since 1930 but their quantitative behaviour is still not well understood. Even so, there has been a great deal of recent progress on the study of Ramsey numbers and their variants, spurred on by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2012
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-012-2710-3